Exact recovery of sparse multiple measurement vectors by l2,p$l_{2,p}$-minimization
نویسندگان
چکیده
منابع مشابه
Sparse Randomized Kaczmarz for Support Recovery of Jointly Sparse Corrupted Multiple Measurement Vectors
While single measurement vector (SMV) models have been widely studied in signal processing, there is a surging interest in addressing the multiple measurement vectors (MMV) problem. In the MMV setting, more than one measurement vector is available and the multiple signals to be recovered share some commonalities such as a common support. Applications in which MMV is a naturally occurring phenom...
متن کاملExact Recovery for Sparse Signal via Weighted l_1 Minimization
Numerical experiments in literature on compressed sensing have indicated that the reweighted l1 minimization performs exceptionally well in recovering sparse signal. In this paper, we develop exact recovery conditions and algorithm for sparse signal via weighted l1 minimization from the insight of the classical NSP (null space property) and RIC (restricted isometry constant) bound. We first int...
متن کاملTight Measurement Bounds for Exact Recovery of Structured Sparse Signals
Standard compressive sensing results state that to exactly recover an s sparse signal in R, one requires O(s·log p) measurements. While this bound is extremely useful in practice, often real world signals are not only sparse, but also exhibit structure in the sparsity pattern. We focus on group-structured patterns in this paper. Under this model, groups of signal coefficients are active (or ina...
متن کاملThe null space property for sparse recovery from multiple measurement vectors
We prove a null space property for the uniqueness of the sparse solution vectors recovered from a minimization in `q quasi-norm subject to multiple systems of linear equations, where q ∈ (0, 1]. Furthermore, we show that the null space property for the setting of the sparse solution vectors for multiple linear systems is equivalent to the null space property for the standard minimization in `q ...
متن کاملExploiting Correlation in Sparse Signal Recovery Problems: Multiple Measurement Vectors, Block Sparsity, and Time-Varying Sparsity
A trend in compressed sensing (CS) is to exploit structure for improved reconstruction performance. In the basic CS model (i.e. the single measurement vector model), exploiting the clustering structure among nonzero elements in the solution vector has drawn much attention, and many algorithms have been proposed such as group Lasso (Yuan & Lin, 2006). However, few algorithms explicitly consider ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2018
ISSN: 1029-242X
DOI: 10.1186/s13660-017-1601-y